#include "hashFind.h"

int main() {
	Element data[] = {19, 14, 23, 01, 68, 20, 84, 27, 55, 11, 10, 79};
	HashTable* table = initHashTable(sizeof(data) / sizeof(data[0]), 0.75);
	if (table == NULL) {
		return -1;
	}
	for (int i = 0; i < sizeof(data) / sizeof(data[0]); ++i) {
		insertData(table, data[i]);
	}
	Element x[] = {1, 19, 85, 4, 9};
	for (int i = 0; i < sizeof(x) / sizeof(x[0]); ++i) {
		int ret = findData(table, x[i]);
		printf("find %d : %d\n", x[i], ret);
	}
	releaseHashTable(table);
	return 0;
}
